A New Logical framework for Deductive Planning
نویسندگان
چکیده
In t.his pap~l' w~ P l'~SPllt. a lop;ira.J fra.IIlPwork for d~filling collsist.ellt axiomat.izat.ions of plallllillg doma.ills. A lallglla.ge to defiIle hasic actiollS alld stl'lIctmed plans is emhedded ill n. logic. Tlti~ allows g(~Ileral propert.ies of a whole planning scenario to be proved as well as pla,lls to he formed deductively. In particular, frame assert.ions and domain cOllst.raillts as illvariants of the basic actions can be formulated and proved. Evell for complex plans most frame assertions are obtained by pmely syntactic alla.Jysis. III such cases the formal proof can be generated in a ulliforlll way. The formalislll we introduce is especially useful when t.reat.ing recursive plans. A tactical t.ltp(lrelll prowl', t.he J(1/.1·hwll!u' /1!tr;mr:tivc Ve7'ijic l' KIV is used to implemPIlt. t.his logical framework.
منابع مشابه
Towards Planning as Concurrency
We present a purely logical framework to planning where we bring the sequential and parallel composition in the plans to the same level, as in process algebras. The problem of expressing causality, which is very challenging for common logics and traditional deductive systems, is solved by resorting to a recently developed extension of multiplicative exponential linear logic with a self-dual, no...
متن کاملModeling Cooperating Agents Scenarios by Deductive Planning Methods and Logical Fiberings
We describe a small but non-trivial 3-agent-robotics scenario by two diierent methods, viz. resource-oriented deductive planning and logical berings. The ultimate aim is to nd a semantics for planning methods by means of berings. To this end, a comparison of the two methods is made and illustrated by the sample scenario, and the correspondences between the basic notions for both methods are cla...
متن کاملActive-U-Datalog: Integrating Active Rules in a Logical Update Language
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a practical technology, deductive rules have to be extended to provide a dynamic behavior. In particular, current applications require not only a support for updates and transactions but also the ability to automaticall...
متن کاملTransaction Datalog: A Compositional Language for Transaction Programming
In the classical model of database transactions, large transactions cannot be built out of smaller ones. Instead, transactions are modelled as atomic and isolated units of work. This model has been widely successful in traditional database applications, in which transactions perform only a few simple operations on small amounts of simply-structured data. Unfortunately, this model is inappropria...
متن کاملLogical Speci cation of Bulk Updates and Sequential
Most current deductive database systems ooer only limited support for updates. We present a logical framework that allows to combine procedural update methods with set-oriented updates. The conventional database update operations are subsumed by our approach.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993